Boosting Decision-Space Diversity in Multi-Objective Optimization using Niching-CMA and Aggregation

نویسندگان

  • Ofer M. Shir
  • Mike Preuss
  • Boris Naujoks
  • Michael Emmerich
چکیده

Two solutions that occupy (almost) the same space in the objective space may have pre-images in the decision space that are essentially different. For a decision maker it can be interesting to know both pre-images in such cases. However, most Pareto optimization algorithms focus on diversity in the objective space only and thus will likely obtain only one solution. In this paper we propose a method aiming for approximation sets that possess a high diversity in objective space as well as decision space. The method integrates aggregation of the two spaces into an existing CMA-niching framework to yield a multi-objective algorithm. Based on a study on synthetic multimodal problems we discuss the aggregation and niching concept and assess the performance of the new approach. We conclude that considering the aggregated space by itself is not sufficient for attaining high diversity in the decision space, but it is rather a bridge for niching to multi-objective optimization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boosting Decision-Space Diversity in Multi-Objective Optimization unsing Nichcing-CMA and Aggregation

Two solutions that occupy (almost) the same space in the objective space may have pre-images in the decision space that are essentially different. For a decision maker it can be interesting to know both pre-images in such cases. However, most Pareto optimization algorithms focus on diversity in the objective space only and thus will likely obtain only one solution. In this paper we propose a me...

متن کامل

A Clustering-Based Niching Framework for the Approximation of Equivalent Pareto-Subsets

In many optimization problems in practice, multiple objectives have to be optimized at the same time. Some multi-objective problems are characterized by multiple connected Pareto-sets at different parts in decision space – also called equivalent Pareto-subsets. We assume that the practitioner wants to approximate all Pareto-subsets to be able to choose among various solutions with different cha...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization

In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...

متن کامل

Urban Land-Use Allocation By A Cell-based Multi-Objective Optimization Algorithm

Allocating urban land-uses to land-units with regard to different criteria and constraints is considered as a spatial multi-objective problem. Generating various urban land-use layouts with respect to defined objectives for urban land-use allocation can support urban planners in confirming appropriate layouts. Hence, in this research, a multi-objective optimization algorithm based on grid is pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008